Long-Distance Q-Resolution with Dependency Schemes
نویسندگان
چکیده
منابع مشابه
Long Distance Q-Resolution with Dependency Schemes
Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for studying the limitations of state-of-the-art search-based QBF solvers that use these systems to generate proofs. We study a proof system that combines two proof systems supported by the solver DepQBF: Q-resolution with generalized universal reduction according to a dependency scheme and long distance Q-re...
متن کاملDependency Schemes and Q-resolution
We propose Q(D)-resolution, a proof system for Quantified Boolean Formulas. Q(D)-resolution is a generalization of Q-resolution parameterized by a dependency scheme D. This system is motivated by the generalization of the QDPLL algorithm using dependency schemes implemented in the solver DepQBF. We prove soundness of Q(D)-resolution for a dependency scheme D that is strictly more general than t...
متن کاملSoundness of Q-resolution with dependency schemes
Article history: Received 1 December 2014 Received in revised form 16 May 2015 Accepted 9 October 2015 Available online 20 October 2015 Communicated by N. Shankar
متن کاملWorking memory differences in long-distance dependency resolution
There is a wealth of evidence showing that increasing the distance between an argument and its head leads to more processing effort, namely, locality effects; these are usually associated with constraints in working memory (DLT: Gibson, 2000; activation-based model: Lewis and Vasishth, 2005). In SOV languages, however, the opposite effect has been found: antilocality (see discussion in Levy et ...
متن کاملDependency of Long-Distance Reflexives
This paper aims to account for dependency of long-distance anaphors within the derivational approach. Dependency between the antecedent and the anaphor is determined by the universal operations, Merge, Move and Agree. Following Hornstein (2001) and Zwart (2002), anaphors in Korean, Chinese, and Japanese are argued to merge with antecedents to obtain anaphoricity. How such a merged complex parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2018
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-018-9467-3